Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information

In this work, we consider a partially cooperative relay broadcast channel (PC-RBC) controlled by random parameters. We provide rate regions for two different situations: 1) when side information (SI) S^n on the random parameters is non-causally known at both the source and the relay and, 2) when side information S^n is non-causally known at the source only. These achievable regions are derived for the general discrete memoryless case first and then extended to the case when the channel is degraded Gaussian and the SI is additive i.i.d. Gaussian. In this case, the source uses generalized dirty paper coding (GDPC), i.e., DPC combined with partial state cancellation, when only the source is informed, and DPC alone when both the source and the relay are informed. It appears that, even though it can not completely eliminate the effect of the SI (in contrast to the case of source and relay being informed), GDPC is particularly useful when only the source is informed.Comment: 7 pages, Proc. of IEEE International Symposium on Information theory, ISIT 2007, Nice, Franc

Statistics of the MLE and approximate upper and lower bounds-part II: Threshold computation and optimal pulse design for TOA estimation

Threshold and ambiguity phenomena are studied in Part I of this paper where approximations for the mean-squared error (MSE) of the maximum-likelihood estimator are proposed using the method of interval estimation (MIE), and where approximate upper and lower bounds are derived. In this part, we consider time-of-arrival estimation and we employ the MIE to derive closed-form expressions of the begin-ambiguity, end-ambiguity and asymptotic signal-to-noise ratio (SNR) thresholds with respect to some features of the transmitted signal. Both baseband and passband pulses are considered. We prove that the begin-ambiguity threshold depends only on the shape of the envelope of the ACR, whereas the end-ambiguity and asymptotic thresholds only on the shape of the ACR. We exploit the results on the begin-ambiguity and asymptotic thresholds to optimize, with respect to the available SNR, the pulse that achieves the minimum attainable MSE. The results of this paper are valid for various estimation problems. © 2014 IEEE

Power allocation for goodput optimization in BICM-OFDM systems

n/

Optimum goodput-oriented power allocation policy for BIC-OFDM packet transmissions

n/

Mobile multimedia communication systems and networks

C

Face Verification Competition on the XM2VTS Database

In the year 2000 a competition was organised to collect face verification results on an identical, publicly available data set using a standard evaluation protocol. The database used was the Xm2vts database along with the Lausanne protocol [14]. Four different institutions submitted results on the database which were subsequently published in [13]. Three years later, a second contest using the same dataset and protocol was organised as part of AVBPA 2003. This time round seven seperate institutions submitted results to the competition. This paper presents the results of the competition and shows that verification results on this protocol have increased in performance by a factor of 3

Heterogeneous and opportunistic wireless networks

Recent years have witnessed the evolution of a large plethora of wireless technologies with different characteristics, as a response of the operators' and users' needs in terms of an efficient and ubiquitous delivery of advanced multimedia services. The wireless segment of network infrastructure has penetrated in our lives, and wireless connectivity has now reached a state where it is considered to be an indispensable service as electricity or water supply. Wireless data networks grow increasingly complex as a multiplicity of wireless information terminals with sophisticated capabilities get embedded in the infrastructure. © 2012 Springer Milan. All Right Reserved